unreachable node

См. также в других словарях:

• недостижимый узел — Узел, с которым невозможно установить соединение из за потери связности или недопустимо большой сетевой задержки при доставке информации. [Л.М. Невдяев. Телекоммуникационные технологии. Англо русский толковый словарь справочник. Под редакцией Ю.М …   Справочник технического переводчика

• ICMPv6 — (Internet Control Message Protocol Version 6) Familie: Internetprotokollfamilie Einsatzgebiet: Obligatorischer Zusatz zu IPv6, Fehlermeldungen, Diagnose, Autoconfiguration, Routing Internet Protokolle im TCP/IP Protokollstapel Internet ICMPv6 …   Deutsch Wikipedia

• Internet Control Message Protocol V6 — ICMPv6 (Internet Control Message Protocol Version 6) Familie: Internetprotokollfamilie Einsatzgebiet: Obligatorischer Zusatz zu IPv6, Fehlermeldungen, Diagnose, Autoconfiguration, Routing Internet Protokolle im TCP/IP Protokollstapel Internet… …   Deutsch Wikipedia

• Garbage Collected Filesystem — In computer science, a Garbage Collected Filesystem is a computer filesystem which uses garbage collection to free disk space when files or directories are deleted. Unlike traditional Unix derived filesystems hard links to directories are allowed …   Wikipedia

• ICMPv6 — Protocolo de Mensajes de Control de Internet Version 6 (ICMPv6 o ICMP para IPv6) es una nueva versión de ICMP y es una parte importante de la arquitectura IPv6 que debe estar completamente soportada por todas las implementaciones y nodos IPv6.… …   Wikipedia Español

• Pastry (DHT) — This article describes the Pastry Distributed Hash Table. For the food, see Pastry. Pastry is an overlay and routing network for the implementation of a distributed hash table similar to Chord. The key value pairs are stored in a redundant peer… …   Wikipedia

• Enhanced Interior Gateway Routing Protocol — (EIGRP) is a Cisco proprietary routing protocol loosely based on their original IGRP. EIGRP is an advanced distance vector routing protocol, with optimizations to minimize both the routing instability incurred after topology changes, as well as… …   Wikipedia

• Bellman-Ford algorithm — The Bellman–Ford algorithm, a label correcting algorithm [cite web |url=http://www.mit.edu/people/dimitrib/SLF.pdf |title=A Simple and Fast Label Correcting Algorithm for Shortest Paths |accessdate=2008 10 01 |author=Dimitri P. Bertsekas… …   Wikipedia

• Control flow graph — Simplified control flowgraphs[1] A control flow graph (CFG) in computer science is a representation, using graph notation, of all paths that might be traversed through a program during its execution …   Wikipedia

• Teredo tunneling — Teredo is a tunneling protocol designed to grant IPv6 connectivity to nodes that are located behind IPv6 unaware NAT devices. It defines a way of encapsulating IPv6 packets within IPv4 UDP datagrams that can be routed through NAT devices and on… …   Wikipedia

• Cascade failure — A cascade failure is a series of events on the internet in which network traffic is severely impaired or halted, to or between larger sections of the internet, caused by failing or disconnected hardware or software. Somewhat similar to the more… …   Wikipedia